// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// ---
// Author: Jeffrey Junfeng Pan (panjunfeng@gmail.com)

#include <iostream>

#include "common/testutil.h"
#include "association_rules.h"

using namespace std;

namespace {

class AssociationRulesTest : public Test {
 protected:

  AssociationRulesTest() {
  }

  virtual ~AssociationRulesTest() {
  }
};

TEST_F(AssociationRulesTest, BasicFunctionTest) {
  frequent_pattern_mining::Itemsets<string> itemsets;

  frequent_pattern_mining::ItemsetFrequencyPair<string> itemset_0;
  itemset_0.frequency = 6;
  itemset_0.itemset.push_back("mine");
  itemsets.InsertItemset(itemset_0);

  frequent_pattern_mining::ItemsetFrequencyPair<string> itemset_1;
  itemset_1.frequency = 4;
  itemset_1.itemset.push_back("tshirts");
  itemsets.InsertItemset(itemset_1);

  frequent_pattern_mining::ItemsetFrequencyPair<string> itemset_2;
  itemset_2.frequency = 2;
  itemset_2.itemset.push_back("shoes");
  itemsets.InsertItemset(itemset_2);

  frequent_pattern_mining::ItemsetFrequencyPair<string> itemset_3;
  itemset_3.frequency = 4;
  itemset_3.itemset.push_back("tshirts");
  itemset_3.itemset.push_back("mine");
  itemsets.InsertItemset(itemset_3);

  frequent_pattern_mining::ItemsetFrequencyPair<string> itemset_4;
  itemset_4.frequency = 2;
  itemset_4.itemset.push_back("shoes");
  itemset_4.itemset.push_back("mine");
  itemsets.InsertItemset(itemset_4);

  itemsets.set_num_transactions(8);

  itemsets.AnalyzeItemsetStructure();

  frequent_pattern_mining::AssociationRules<string> rules;
  rules.BuildRules(itemsets, 0, -1, 0, -1);
  cout << endl;
  cout << rules.ToDebugString();

  rules.BuildRules(itemsets, -1, 0.50, 0, -1);
  cout << endl;
  cout << rules.ToDebugString();
}

}  // namespace

int main(int argc, char **argv) {
  return 0;
}
